/*
 * @lc app=leetcode.cn id=598 lang=cpp
 *
 * [598] 范围求和 II
 */

// @lc code=start
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
    int maxCount(int m, int n, vector<vector<int>>& ops) {
        for(const auto& op : ops)
        {
            m = std::min(m, op[0]);
            n = std::min(n, op[1]);
        }
        return (m) * (n);
    }
};
// @lc code=end

